منابع مشابه
Unit Mixed Interval Graphs
In this paper we extend the work of Rautenbach and Szwarcfiter [8] by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that may or may not contain their endpoints. A characterization was proved independently by Joos in [6], however our approach provides an algorithm that produces such a representation, as well as a forbidden graph char...
متن کاملIntegral Mixed Unit Interval Graphs
We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.
متن کاملPrecoloring extension on unit interval graphs
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [6], we show that the precoloring extension problem is NP-complete on unit interval graphs.
متن کاملClique-width of unit interval graphs
The clique-width is known to be unbounded in the class of unit interval graphs. In this paper, we show that this is a minimal hereditary class of unbounded clique-width, i.e., in every hereditary subclass of unit interval graphs the clique-width is bounded by a constant.
متن کاملMulti-Armed Bandits on Unit Interval Graphs
An online learning problem with side information on the similarity and dissimilarity across different actions is considered. The problem is formulated as a stochastic multiarmed bandit problem with a graph-structured learning space. Each node in the graph represents an arm in the bandit problem and an edge between two nodes represents closeness in their mean rewards. It is shown that the result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.02.014